Asynchonous Distributed Components: Concurrency and Determinacy
نویسندگان
چکیده
Based on the impς-calculus, ASP (Asynchronous Sequential Processes) defines distributed applications behaving deterministically. This article extends ASP by building hierarchical and asynchronous distributed components. Components are hierarchical a composite can be built from other components, and distributed a composite can span over several machines. This article also shows how the asynchronous component model can be used to statically assert component determinism.
منابع مشابه
Proving Ambiguity
We show how using intuitionistic linear logic ambiguities can be speciied and resolved while respecting constraints imposed on the structure of representations. Our approach is to use linear logic as a metalanguage to deene underspeciied representations and to infer possible courses of disambiguations. We argue that in disambiguating underspeciied representations the following four factors play...
متن کاملOptimization of majority protocol for controlling transactions concurrency in distributed databases by multi-agent systems
In this paper, we propose a new concurrency control algorithm based on multi-agent systems which is an extension of majority protocol. Then, we suggest a clustering approach to get better results in reliability, decreasing message passing and algorithm’s runtime. Here, we consider n different transactions working on non-conflict data items. Considering execution efficiency of some different...
متن کاملSynthesizing Distributed Transition Systems from Global Specification
We study the problem of synthesizing distributed implementations from global speciications. In particular, we characterize when a global transition system can be implemented as a synchronized product of local transition systems. Our work extends a number of previous studies in this area which have tended to make strong assumptions about the speciication|either in terms of determinacy or in term...
متن کاملOn the determinacy of concurrent games on event structures with infinite winning sets
We consider nondeterministic concurrent games played on event structures and study their determinacy problem—the existence of winning strategies. It is known that when the winning conditions of the games are characterized by a collection of finite winning sets/plays, a restriction (called race-freedom) on the boards where the games are played guarantees determinacy. However the games may no lon...
متن کاملModularity and Scalability in Calvin
Calvin is a transaction scheduling and replication management layer for distributed storage systems. By first writing transaction requests to a durable, replicated log, and then using a concurrency control mechanism that emulates a deterministic serial execution of the log’s transaction requests, Calvin supports strongly consistent replication and fully ACID distributed transactions while incur...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006